Shifts of the stable Kneser graphs and hom-idempotence
نویسندگان
چکیده
A graph G is said to be hom-idempotent if there is a homomorphism from G2 to G, and weakly hom-idempotent if for some n ≥ 1 there is a homomorphism from Gn+1 to Gn. Larose et al. (1998) proved that Kneser graphs KG(n, k) are not weakly hom-idempotent for n ≥ 2k + 1, k ≥ 2. For s ≥ 2, we characterize all the shifts (i.e., automorphisms of the graph that map every vertex to one of its neighbors) of s-stable Kneser graphs KG(n, k)s−stab and we show that 2-stable Kneser graphs are not weakly hom-idempotent, for n ≥ 2k + 2, k ≥ 2. Moreover, for s, k ≥ 2, we prove that sstable Kneser graphs KG(ks+1, k)s−stab are circulant graphs and so hom-idempotent graphs. Finally, for s ≥ 3, we show that s-stable Kneser graphs KG(2s+2, 2)s−stab are cores, notχ-critical, not homidempotent and their chromatic number is equal to s + 2. © 2016 Elsevier Ltd. All rights reserved.
منابع مشابه
On Normal Cayley Graphs and Hom-idempotent Graphs
A graph G is said to be hom-idempotent if there is a homomorphism from G2 to G, and weakly hom-idempotent if for some n ≥ 1 there is a homomorphism from Gn+1 to Gn . We characterize both classes of graphs in terms of a special class of Cayley graphs called normal Cayley graphs. This allows us to construct, for any integer n, a Cayley graph G such that Gn+1 → Gn 6→ Gn−1, answering a question of ...
متن کاملSymmetries of the Stable Kneser Graphs
It is well known that the automorphism group of the Kneser graph KGn,k is the symmetric group on n letters. For n ≥ 2k + 1, k ≥ 2, we prove that the automorphism group of the stable Kneser graph SGn,k is the dihedral group of order 2n. Let [n] := [1, 2, 3, . . . , n]. For each n ≥ 2k, n, k ∈ {1, 2, 3, . . .}, the Kneser graph KGn,k has as vertices the k-subsets of [n] with edges defined by disj...
متن کاملStable sets of maximal size in Kneser-type graphs
We introduce a family of vertex-transitive graphs with specified subgroups of automorphisms which generalise Kneser graphs, powers of complete graphs and Cayley graphs of permutations. We compute the stability ratio for a wide class of these. Under certain conditions we characterise their stable sets of maximal size. © 2003 Elsevier Ltd. All rights reserved. MSC (2000): 05D05; 05C99
متن کاملColorings of Graphs Power
In this paper some coloring properties of graphs power have been presented. In this regard, the helical graphs have been introduced and it was shown that they are hom-universal with respect to high odd-girth graphs whose lth power is bounded with a Kneser graph. In the sequel, we have considered Pentagon’s problem of Nešetřil which this problem is about the existence of high girth cubic graphs ...
متن کاملIndependence Complexes of Stable Kneser Graphs
For integers n ≥ 1, k ≥ 0, the stable Kneser graph SGn,k (also called the Schrijver graph) has as vertex set the stable n-subsets of [2n + k] and as edges disjoint pairs of n-subsets, where a stable n-subset is one that does not contain any 2-subset of the form {i, i + 1} or {1, 2n + k}. The stable Kneser graphs have been an interesting object of study since the late 1970’s when A. Schrijver de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 62 شماره
صفحات -
تاریخ انتشار 2017